Computer-Aided Way to Prove Theorems in Scheduling
نویسندگان
چکیده
Аннотация For two scheduling problems (O3||Cmax and AL3||Cmax) tight bounds of the optima localization intervals are found in terms of lower bounds (C̃ and Ĉ, respectively) computable in linear time. The main part of the proof was made with an aid of computer. As a by-product, we obtain linear-time approximation algorithms for solving these problems with worst-case performance ratios 4/3 and 5/3, respectively.
منابع مشابه
Survey on Perception of People Regarding Utilization of Computer Science & Information Technology in Manipulation of Big Data, Disease Detection & Drug Discovery
this research explores the manipulation of biomedical big data and diseases detection using automated computing mechanisms. As efficient and cost effective way to discover disease and drug is important for a society so computer aided automated system is a must. This paper aims to understand the importance of computer aided automated system among the people. The analysis result from collected da...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملOn some fixed points properties and convergence theorems for a Banach operator in hyperbolic spaces
In this paper, we prove some fixed points properties and demiclosedness principle for a Banach operator in uniformly convex hyperbolic spaces. We further propose an iterative scheme for approximating a fixed point of a Banach operator and establish some strong and $Delta$-convergence theorems for such operator in the frame work of uniformly convex hyperbolic spaces. The results obtained in this...
متن کاملTHE IMPACT OF USING COMPUTER-AIDED ARGUMENT MAPPING (CAAM) ON THE IMPROVEMENT OF IRANIAN EFL LEARNERS’ WRITING SELF-REGULATION
The present study was conducted to investigate the impact of using computer-aided argument mapping (CAAM) on the improvement of Iranian learners’ writing self-regulation. To this end, 90 participants out of 127 senior university students in English translation were selected after administrating language proficiency test, as well as an essay writing test for the purpose of homogenizing the learn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998